On Real-Time Quasi-Durable Checkpointing
نویسندگان
چکیده
This study investigates real-time checkpointing techniques in the context of distributed process control applications where checkpointing and recovery operations must meet timing constraints, such as process deadline and plant state validity. We introduce the notion of quasidurability, which allows one to rnake trudeoffs between storage device reliability and the process control and recovery timing constraints. Based on this notion, we study three protocols for real-time quasi-durable checkpointing and recovery. For each protocol, we analyze its recoverabiliq and provide the su-cient and necessary conditions for a set of device to be feasible for checkpointing and recovery.
منابع مشابه
Quasi-synchronous Checkpointing: Models, Characterization, and Classiication
Checkpointing algorithms are classiied as synchronous and asynchronous in the literature. In synchronous checkpointing, processes synchronize their checkpointing activities so that a globally consistent set of checkpoints is always maintained in the system. Synchronizing checkpointing activity involves message overhead and process execution may have to be suspended during the checkpointing coor...
متن کاملA New Checkpointing Approach for Mobile Distributed System
In this paper, we introduce a weighted checkpointing approach for the mobile distributed computing system (MDCS) that significantly reduces checkpointing overheads on mobile nodes. Checkpoint protocols proposed so far in the literature for MDCS are either coordinated, log based or quasi-synchronous. Coordinated checkpointing requires extra synchronization messages and may block the underlying c...
متن کاملAnalysis of checkpointing for schedulability of real-time systems
Checkpointing is a relatively cost effective method for achieving fault tolerance in real-time systems. Since checkpointing schemes depend on time redundancy, they could affect the correctness of the system by causing deadlines to be missed. This paper provides exact schedulability tests for fault tolerant task sets under specified failure hypothesis and employing checkpointing to assist in fau...
متن کاملQuasi - Synchronous Checkpointing : Models
Checkpointing algorithms are classiied as synchronous and asynchronous in the literature. In synchronous checkpointing, processes synchronize their checkpointing activities so that a globally consistent set of checkpoints is always maintained in the system. Synchronizing checkpointing activity involves message overhead and process execution may have to be suspended during the checkpointing coor...
متن کاملFault Recovery Based on Checkpointing for Hard Real-Time Embedded Systems
Safety-critical embedded systems often operate in harsh environmental conditions that necessitate fault-tolerant computing techniques. Many safety-critical systems also execute realtime applications. The correctness of these systems depends not only on the logical result of computation, but also on the time at which the results are produced. The missing of task deadlines can therefore be viewed...
متن کامل